航班快速恢复建模与仿真研究

随着民用航空的发展与竞争,航班延误不仅影响航空飞行的安全与正常,更与航空公司的运营效率、运营成本及乘客利益息息相关。针对某一恶劣天气影响,对某公司受影响航班进行重新调配,考虑到航班的备降、盘旋等待、延误、取消等多种状态,以总成本最小为目标函数,建立航班快速恢复模型,通过MATLAB运用遗传算法设计航班恢复算法进行求解,得出最经济的航班恢复方案。     

高速铁路枢纽站技术作业计划与动车所调车作业计划协同编制研究

分析高速铁路枢纽站技术作业计划与动车所调车作业计划的协同编制过程,提出了将两个计划一体化编制的思想。以需安排作业效益最大化为优化目标,构建基于动车组车底的高速铁路枢纽站与动车所作业计划协同编制模型。针对模型特点,提出瓶颈工序、启发式分配规则及粗粒度主从进程模式的并行禁忌搜索策略(PTS)相结合的混合优化算法,首先确定作业安排瓶颈工序,然后启动主进程和若干从进程,主进程运用启发式分配规则快速生成初始解分配给从进程,从进程运用与瓶颈工序相关的禁忌算法搜索优化解,并反馈给主进程,主进程记录全局最优解并根据交叉策略生成新的初始解,重新分配给从进程进行TS搜索。最后,用实例验证了模型和算法的有效性。     

斜腿刚构桥几何布局的优化设计

采用数学规划的方法从静力和动力两方面对斜腿刚构桥的几何布局进行优化设计。静力优化设计的优化目标是截面截面应力平方均值最小，动力优化设计的优化目标是结构自振周期平方和最小。采用了直接搜索法寻优。通过算例可知，这两种优化设计方法均可行，且均为刚性设计。     

基于红外搜索系统的被动测距技术研究

红外搜索系统是一种被动探测系统，量测数据中无目标的距离量；而评判来袭目标的威胁程度离不开其距离量。介绍了基于红外搜索系统的被动测距技术测量目标距离的算法、原理框图以及仿真试验与结果。     

基于ANSYS结果文件的结构强度可视化研究

运用FORTRAN编程对ANSYS软件的二进制结果文件快速读取,基于ORE B12/RP17方法将多轴应力转化为单轴应力,由单元/节点的方向应力计算结构的最大应力、最小应力、平均应力和应力幅,根据Haigh形式的Goodman曲线对结构进行疲劳强度评估,并将疲劳强度分析结果写入ANSYS结果文件,在ANSYS通用后处理器以图形的形式显示疲劳强度结果,实现结构疲劳强度结果的可视化。     

基于排序二叉树的摘挂列车编组钩计划自动编制方法

根据摘挂列车编组调车作业原理,将摘挂列车下落问题抽象为排序问题,提出一种基于排序二叉树的编组钩计划自动编制方法.根据待编列车序列构造排序二叉树;利用排序二叉树的有序性快速搜索出有序车组序列,将其作为下落方案的可选集.考虑邻组、暂合列内收编固定组组别和空闲组别、端组等因素,从可选集中筛选出较优的下落方案.通过定义收编固定组简化列车收编过程,实现列车收编过程的计算机自动编制.通过实例验证,采用该方法降低了选择下落方案的复杂性,减少了列车编组钩计划的调车钩数,而且可根据实际调车线数灵活调整方案.     

基于二进制粒子群算法的母联闭合型电网重构策略

为解决母联闭合型电网发生故障时的电网重构问题,提出一种基于二进制粒子群算法的电网重构策略.根据深水半潜平台电网特殊的网络架构和电气特性,建立以最大程度恢复重要负载供电为目标,以电网结构和系统容量为约束条件的母联闭合型电网故障恢复模型.为提升求解效率,为该模型设计基于二进制粒子群算法的两阶段优化求解流程,并将求解结果与混沌遗传算法和免疫克隆算法的仿真结果相对比.仿真结果表明,提出的电网重构策略具有较高的搜索效率和较强的寻优能力,能有效提高母闭合型电网故障恢复的速度和精度.     

Free-floating bike sharing: Solving real-life large-scale static rebalancing problems

Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the success of FFBS depends on the efficiency of its rebalancing operations to serve the maximal demand as possible.Bicycle rebalancing refers to the reestablishment of the number of bikes at sites to desired quantities by using a fleet of vehicles transporting the bicycles. Static rebalancing for SBBS is a challenging combinatorial optimization problem. FFBS takes it a step further, with an increase in the scale of the problem. This article is the first effort in a series of studies of FFBS planning and management, tackling static rebalancing with single and multiple vehicles. We present a Novel Mixed Integer Linear Program for solving the Static Complete Rebalancing Problem. The proposed formulation, can not only handle single as well as multiple vehicles, but also allows for multiple visits to a node by the same vehicle. We present a hybrid nested large neighborhood search with variable neighborhood descent algorithm, which is both effective and efficient in solving static complete rebalancing problems for large-scale bike sharing programs.Computational experiments were carried out on the 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP) instances used previously in the literature and on three new sets of instances, two (one real-life and one general) based on Share-A-Bull Bikes (SABB) FFBS program recently launched at the Tampa campus of University of South Florida and the other based on Divvy SBBS in Chicago. Computational experiments on the 1-PDTSP instances demonstrate that the proposed algorithm outperforms a tabu search algorithm and is highly competitive with exact algorithms previously reported in the literature for solving static rebalancing problems in SBSS. Computational experiments on the SABB and Divvy instances, demonstrate that the proposed algorithm is able to deal with the increase in scale of the static rebalancing problem pertaining to both FFBS and SBBS, while deriving high-quality solutions in a reasonable amount of CPU time.     

变邻域搜索求解公共交通乘务调度问题

公共交通乘务调度问题是一个将车辆工作切分为一组合法班次的过程,它是NP难问题,许多求解方法的效率都与班次评价密不可分,本文通过裁剪TOPSIS方法(Technique for Order Preference by Similarity to an Ideal Solution)设计了TOPSIS班次评价方法.此外,通过裁剪变邻域搜索算法使之适合求解乘务调度问题,提出了基于变邻域搜索的乘务调度方法(Crew Scheduling Approach Based on Variable Neighbourhood Search,VNS),其中,并入了TOPSIS班次评价方法在调度过程中进行班次评价,设计了两种带概率的复合邻域结构以增加搜索的多样性,帮助跳出局部最优,在VNS中利用模拟退火算法进行局部搜索.利用中国公共交通中的11组实例进行了测试,测试结果表明,VNS优于两种新近提出的乘务调度方法,且其结果关于班次数接近于下界.     

The load-dependent vehicle routing problem and its pick-up and delivery extension

The present paper examines a Vehicle Routing Problem (VRP) of major practical importance which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for transportation activities where the weight of the transported cargo accounts for a significant part of the vehicle gross weight. Contrary to the basic VRP which calls for the minimization of the distance travelled, the LDVRP objective is aimed at minimizing the total product of the distance travelled and the gross weight carried along this distance. Thus, it is capable of producing sensible routing plans which take into account the variation of the cargo weight along the vehicle trips. The LDVRP objective is closely related to the total energy requirements of the vehicle fleet, making it a credible alternative when the environmental aspects of transportation activities are examined and optimized. A novel LDVRP extension which considers simultaneous pick-up and delivery service is introduced, formulated and solved for the first time. To deal with large-scale instances of the examined problems, we propose a local-search algorithm. Towards an efficient implementation, the local-search algorithm employs a computational scheme which calculates the complex weighted-distance objective changes in constant time. Solution results are presented for both problems on a variety of well-known test cases demonstrating the effectiveness of the proposed solution approach. The structure of the obtained LDVRP and VRP solutions is compared in pursuit of interesting conclusions on the relative suitability of the two routing models, when the decision maker must deal with the weighted distance objective. In addition, results of a branch-and-cut procedure for small-scale instances of the LDVRP with simultaneous pick-ups and deliveries are reported. Finally, extensive computational experiments have been performed to explore the managerial implications of three key problem characteristics, namely the deviation of customer demands, the cargo to tare weight ratio, as well as the size of the available vehicle fleet.